Computing Network Reliability with Imperfect Nodes Using Modified Binary Decision Diagram

Since more and more enterprises become dependent upon computer communication network or networked computing applications particularly after the growth of local area network, wide area network and internet. Therefore failure of a single component may directly affect the functioning of the network. The nodes and the edges may fail in any real network. In this paper we have proposed an efficient algorithm to compute the reliability of a network (which has imperfect nodes) using modified binary decision diagram. After that we have compared our algorithm with an existing algorithm based on edge expansion diagram using ordered binary decision diagram. The size of the modified binary decision diagram obtained by our algorithm is much less than the size of the ordered binary decision diagram, however the reliability results are same.